package com.dyz.leetcode._06_binarySearch;

public class _153_findMin {
    public int findMin1(int[] nums) {
        int min = Integer.MAX_VALUE;
        for(int num:nums){
            if(num<min){
                min=num;
            }
        }
        return min;
    }
    //二分查找
    public int findMin(int[] nums) {
        int left =0;
        int right = nums.length-1;
        while(left<right){
            int mid = left+(right-left)/2;
            if(nums[mid]>nums[right]){
                left = mid +1;
            }else{
                right = mid;
            }
        }
        return nums[left];
    }
}
